Left Termination of the query pattern
ordered(g)
w.r.t. the given Prolog program could successfully be proven:

(0) Obligation:

Clauses:

ordered([]).
ordered(.(X, [])).
ordered(.(X, .(Y, Xs))) :- ','(le(X, Y), ordered(.(Y, Xs))).
le(s(X), s(Y)) :- le(X, Y).
le(0, s(0)).
le(0, 0).

Query: ordered(g)

(1) PrologToPrologProblemTransformerProof (SOUND transformation)

Built Prolog problem from termination graph ICLP10.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="1: ordered(T1)\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: ordered(T1), SCOPE: 1, CLAUSE: 0 | ordered(T1), SCOPE: 1, CLAUSE: 1 | ordered(T1), SCOPE: 1, CLAUSE: 2\n\nT1 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: true | ordered([]), SCOPE: 1, CLAUSE: 1 | ordered([]), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: ordered(T1), SCOPE: 1, CLAUSE: 1 | ordered(T1), SCOPE: 1, CLAUSE: 2\n\nT1 is ground\nordered(T1) !=? ordered([])", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: ordered([]), SCOPE: 1, CLAUSE: 1 | ordered([]), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: ordered([]), SCOPE: 1, CLAUSE: 2\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: true | ordered(.(T3, [])), SCOPE: 1, CLAUSE: 2\n\nT3 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: ordered(T1), SCOPE: 1, CLAUSE: 2\n\nT1 is ground\nX6 is free\nordered(T1) !=? ordered([])\nordered(T1) !=? ordered(.(X6, []))", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: ordered(.(T3, [])), SCOPE: 1, CLAUSE: 2\n\nT3 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: ','(le(T8, T9), ordered(.(T9, T10)))\n\nT8 is ground\nT9 is ground\nT10 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: ','(le(T8, T9), ordered(.(T9, T10))), SCOPE: 2, CLAUSE: 3 | ','(le(T8, T9), ordered(.(T9, T10))), SCOPE: 2, CLAUSE: 4 | ','(le(T8, T9), ordered(.(T9, T10))), SCOPE: 2, CLAUSE: 5\n\nT8 is ground\nT9 is ground\nT10 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: ','(le(T8, T9), ordered(.(T9, T10))), SCOPE: 2, CLAUSE: 3\n\nT8 is ground\nT9 is ground\nT10 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: ','(le(T8, T9), ordered(.(T9, T10))), SCOPE: 2, CLAUSE: 4 | ','(le(T8, T9), ordered(.(T9, T10))), SCOPE: 2, CLAUSE: 5\n\nT8 is ground\nT9 is ground\nT10 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: ','(le(T19, T20), ordered(.(s(T20), T10)))\n\nT10 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: le(T19, T20)\n\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: ordered(.(s(T20), T10))\n\nT10 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: le(T19, T20), SCOPE: 3, CLAUSE: 3 | le(T19, T20), SCOPE: 3, CLAUSE: 4 | le(T19, T20), SCOPE: 3, CLAUSE: 5\n\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: le(T19, T20), SCOPE: 3, CLAUSE: 3\n\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: le(T19, T20), SCOPE: 3, CLAUSE: 4 | le(T19, T20), SCOPE: 3, CLAUSE: 5\n\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: le(T33, T34)\n\nT33 is ground\nT34 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="25: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: le(T19, T20), SCOPE: 3, CLAUSE: 4\n\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: le(T19, T20), SCOPE: 3, CLAUSE: 5\n\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: ','(le(T8, T9), ordered(.(T9, T10))), SCOPE: 2, CLAUSE: 4\n\nT8 is ground\nT9 is ground\nT10 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: ','(le(T8, T9), ordered(.(T9, T10))), SCOPE: 2, CLAUSE: 5\n\nT8 is ground\nT9 is ground\nT10 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: ordered(.(s(0), T10))\n\nT10 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: ordered(.(0, T10))\n\nT10 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 40 [arrowhead = none ];
40 -> 2;

41 [label="EVAL with clause\nordered([]).\nand substitutionT1 -> []", fontsize=14, style = filled, fillcolor = lightblue];
2 -> 41 [arrowhead = none ];
41 -> 3;

42 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
2 -> 42 [arrowhead = none ];
42 -> 4;

43 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
3 -> 43 [arrowhead = none ];
43 -> 5;

44 [label="EVAL with clause\nordered(.(X6, [])).\nand substitutionX6 -> T3,\nT1 -> .(T3, [])", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 44 [arrowhead = none ];
44 -> 8;

45 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
4 -> 45 [arrowhead = none ];
45 -> 9;

46 [label="BACKTRACK\nfor clause: ordered(.(X, []))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
5 -> 46 [arrowhead = none ];
46 -> 6;

47 [label="BACKTRACK\nfor clause: ordered(.(X, .(Y, Xs))) :- ','(le(X, Y), ordered(.(Y, Xs)))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
6 -> 47 [arrowhead = none ];
47 -> 7;

48 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
8 -> 48 [arrowhead = none ];
48 -> 10;

49 [label="EVAL with clause\nordered(.(X13, .(X14, X15))) :- ','(le(X13, X14), ordered(.(X14, X15))).\nand substitutionX13 -> T8,\nX14 -> T9,\nX15 -> T10,\nT1 -> .(T8, .(T9, T10))", fontsize=14, style = filled, fillcolor = lightblue];
9 -> 49 [arrowhead = none ];
49 -> 12;

50 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
9 -> 50 [arrowhead = none ];
50 -> 13;

51 [label="BACKTRACK\nfor clause: ordered(.(X, .(Y, Xs))) :- ','(le(X, Y), ordered(.(Y, Xs)))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
10 -> 51 [arrowhead = none ];
51 -> 11;

52 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
12 -> 52 [arrowhead = none ];
52 -> 14;

53 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
14 -> 53 [arrowhead = none ];
53 -> 15;

54 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
14 -> 54 [arrowhead = none ];
54 -> 16;

55 [label="EVAL with clause\nle(s(X24), s(X25)) :- le(X24, X25).\nand substitutionX24 -> T19,\nT8 -> s(T19),\nX25 -> T20,\nT9 -> s(T20)", fontsize=14, style = filled, fillcolor = lightblue];
15 -> 55 [arrowhead = none ];
55 -> 17;

56 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
15 -> 56 [arrowhead = none ];
56 -> 18;

57 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
16 -> 57 [arrowhead = none ];
57 -> 34;

58 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
16 -> 58 [arrowhead = none ];
58 -> 35;

59 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
17 -> 59 [arrowhead = none ];
59 -> 19;

60 [label="SPLIT 2\nnew knowledge:\nT19 is ground\nT20 is ground", fontsize=14, style = filled, fillcolor = violet];
17 -> 60 [arrowhead = none ];
60 -> 20;

61 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
19 -> 61 [arrowhead = none ];
61 -> 21;

62 [label="INSTANCE with matching:\nT1 -> .(s(T20), T10)", fontsize=14, style = filled, fillcolor = lightgrey];
20 -> 62 [arrowhead = none , style=dashed];
62 -> 1[style=dashed];

63 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
21 -> 63 [arrowhead = none ];
63 -> 22;

64 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
21 -> 64 [arrowhead = none ];
64 -> 23;

65 [label="EVAL with clause\nle(s(X38), s(X39)) :- le(X38, X39).\nand substitutionX38 -> T33,\nT19 -> s(T33),\nX39 -> T34,\nT20 -> s(T34)", fontsize=14, style = filled, fillcolor = lightblue];
22 -> 65 [arrowhead = none ];
65 -> 24;

66 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
22 -> 66 [arrowhead = none ];
66 -> 25;

67 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
23 -> 67 [arrowhead = none ];
67 -> 26;

68 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
23 -> 68 [arrowhead = none ];
68 -> 27;

69 [label="INSTANCE with matching:\nT19 -> T33\nT20 -> T34", fontsize=14, style = filled, fillcolor = lightgrey];
24 -> 69 [arrowhead = none , style=dashed];
69 -> 19[style=dashed];

70 [label="EVAL with clause\nle(0, s(0)).\nand substitutionT19 -> 0,\nT20 -> s(0)", fontsize=14, style = filled, fillcolor = lightblue];
26 -> 70 [arrowhead = none ];
70 -> 28;

71 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
26 -> 71 [arrowhead = none ];
71 -> 29;

72 [label="EVAL with clause\nle(0, 0).\nand substitutionT19 -> 0,\nT20 -> 0", fontsize=14, style = filled, fillcolor = lightblue];
27 -> 72 [arrowhead = none ];
72 -> 31;

73 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
27 -> 73 [arrowhead = none ];
73 -> 32;

74 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
28 -> 74 [arrowhead = none ];
74 -> 30;

75 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
31 -> 75 [arrowhead = none ];
75 -> 33;

76 [label="EVAL with clause\nle(0, s(0)).\nand substitutionT8 -> 0,\nT9 -> s(0)", fontsize=14, style = filled, fillcolor = lightblue];
34 -> 76 [arrowhead = none ];
76 -> 36;

77 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
34 -> 77 [arrowhead = none ];
77 -> 37;

78 [label="EVAL with clause\nle(0, 0).\nand substitutionT8 -> 0,\nT9 -> 0", fontsize=14, style = filled, fillcolor = lightblue];
35 -> 78 [arrowhead = none ];
78 -> 38;

79 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
35 -> 79 [arrowhead = none ];
79 -> 39;

80 [label="INSTANCE with matching:\nT1 -> .(s(0), T10)", fontsize=14, style = filled, fillcolor = lightgrey];
36 -> 80 [arrowhead = none , style=dashed];
80 -> 1[style=dashed];

81 [label="INSTANCE with matching:\nT1 -> .(0, T10)", fontsize=14, style = filled, fillcolor = lightgrey];
38 -> 81 [arrowhead = none , style=dashed];
81 -> 1[style=dashed];

}

(2) Obligation:

Clauses:

leA(s(T33), s(T34)) :- leA(T33, T34).
leA(0, s(0)).
leA(0, 0).
orderedB([]).
orderedB(.(T3, [])).
orderedB(.(s(T19), .(s(T20), T10))) :- leA(T19, T20).
orderedB(.(s(T19), .(s(T20), T10))) :- ','(leA(T19, T20), orderedB(.(s(T20), T10))).
orderedB(.(0, .(s(0), T10))) :- orderedB(.(s(0), T10)).
orderedB(.(0, .(0, T10))) :- orderedB(.(0, T10)).

Query: orderedB(g)

(3) PrologToPiTRSProof (SOUND transformation)

We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:
orderedB_in: (b)
leA_in: (b,b)
Transforming Prolog into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

orderedB_in_g([]) → orderedB_out_g([])
orderedB_in_g(.(T3, [])) → orderedB_out_g(.(T3, []))
orderedB_in_g(.(s(T19), .(s(T20), T10))) → U2_g(T19, T20, T10, leA_in_gg(T19, T20))
leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → orderedB_out_g(.(s(T19), .(s(T20), T10)))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → U3_g(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
orderedB_in_g(.(0, .(s(0), T10))) → U4_g(T10, orderedB_in_g(.(s(0), T10)))
orderedB_in_g(.(0, .(0, T10))) → U5_g(T10, orderedB_in_g(.(0, T10)))
U5_g(T10, orderedB_out_g(.(0, T10))) → orderedB_out_g(.(0, .(0, T10)))
U4_g(T10, orderedB_out_g(.(s(0), T10))) → orderedB_out_g(.(0, .(s(0), T10)))
U3_g(T19, T20, T10, orderedB_out_g(.(s(T20), T10))) → orderedB_out_g(.(s(T19), .(s(T20), T10)))

Pi is empty.

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog

(4) Obligation:

Pi-finite rewrite system:
The TRS R consists of the following rules:

orderedB_in_g([]) → orderedB_out_g([])
orderedB_in_g(.(T3, [])) → orderedB_out_g(.(T3, []))
orderedB_in_g(.(s(T19), .(s(T20), T10))) → U2_g(T19, T20, T10, leA_in_gg(T19, T20))
leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → orderedB_out_g(.(s(T19), .(s(T20), T10)))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → U3_g(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
orderedB_in_g(.(0, .(s(0), T10))) → U4_g(T10, orderedB_in_g(.(s(0), T10)))
orderedB_in_g(.(0, .(0, T10))) → U5_g(T10, orderedB_in_g(.(0, T10)))
U5_g(T10, orderedB_out_g(.(0, T10))) → orderedB_out_g(.(0, .(0, T10)))
U4_g(T10, orderedB_out_g(.(s(0), T10))) → orderedB_out_g(.(0, .(s(0), T10)))
U3_g(T19, T20, T10, orderedB_out_g(.(s(T20), T10))) → orderedB_out_g(.(s(T19), .(s(T20), T10)))

Pi is empty.

(5) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LOPSTR] we result in the following initial DP problem:
Pi DP problem:
The TRS P consists of the following rules:

ORDEREDB_IN_G(.(s(T19), .(s(T20), T10))) → U2_G(T19, T20, T10, leA_in_gg(T19, T20))
ORDEREDB_IN_G(.(s(T19), .(s(T20), T10))) → LEA_IN_GG(T19, T20)
LEA_IN_GG(s(T33), s(T34)) → U1_GG(T33, T34, leA_in_gg(T33, T34))
LEA_IN_GG(s(T33), s(T34)) → LEA_IN_GG(T33, T34)
U2_G(T19, T20, T10, leA_out_gg(T19, T20)) → U3_G(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
U2_G(T19, T20, T10, leA_out_gg(T19, T20)) → ORDEREDB_IN_G(.(s(T20), T10))
ORDEREDB_IN_G(.(0, .(s(0), T10))) → U4_G(T10, orderedB_in_g(.(s(0), T10)))
ORDEREDB_IN_G(.(0, .(s(0), T10))) → ORDEREDB_IN_G(.(s(0), T10))
ORDEREDB_IN_G(.(0, .(0, T10))) → U5_G(T10, orderedB_in_g(.(0, T10)))
ORDEREDB_IN_G(.(0, .(0, T10))) → ORDEREDB_IN_G(.(0, T10))

The TRS R consists of the following rules:

orderedB_in_g([]) → orderedB_out_g([])
orderedB_in_g(.(T3, [])) → orderedB_out_g(.(T3, []))
orderedB_in_g(.(s(T19), .(s(T20), T10))) → U2_g(T19, T20, T10, leA_in_gg(T19, T20))
leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → orderedB_out_g(.(s(T19), .(s(T20), T10)))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → U3_g(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
orderedB_in_g(.(0, .(s(0), T10))) → U4_g(T10, orderedB_in_g(.(s(0), T10)))
orderedB_in_g(.(0, .(0, T10))) → U5_g(T10, orderedB_in_g(.(0, T10)))
U5_g(T10, orderedB_out_g(.(0, T10))) → orderedB_out_g(.(0, .(0, T10)))
U4_g(T10, orderedB_out_g(.(s(0), T10))) → orderedB_out_g(.(0, .(s(0), T10)))
U3_g(T19, T20, T10, orderedB_out_g(.(s(T20), T10))) → orderedB_out_g(.(s(T19), .(s(T20), T10)))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(6) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

ORDEREDB_IN_G(.(s(T19), .(s(T20), T10))) → U2_G(T19, T20, T10, leA_in_gg(T19, T20))
ORDEREDB_IN_G(.(s(T19), .(s(T20), T10))) → LEA_IN_GG(T19, T20)
LEA_IN_GG(s(T33), s(T34)) → U1_GG(T33, T34, leA_in_gg(T33, T34))
LEA_IN_GG(s(T33), s(T34)) → LEA_IN_GG(T33, T34)
U2_G(T19, T20, T10, leA_out_gg(T19, T20)) → U3_G(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
U2_G(T19, T20, T10, leA_out_gg(T19, T20)) → ORDEREDB_IN_G(.(s(T20), T10))
ORDEREDB_IN_G(.(0, .(s(0), T10))) → U4_G(T10, orderedB_in_g(.(s(0), T10)))
ORDEREDB_IN_G(.(0, .(s(0), T10))) → ORDEREDB_IN_G(.(s(0), T10))
ORDEREDB_IN_G(.(0, .(0, T10))) → U5_G(T10, orderedB_in_g(.(0, T10)))
ORDEREDB_IN_G(.(0, .(0, T10))) → ORDEREDB_IN_G(.(0, T10))

The TRS R consists of the following rules:

orderedB_in_g([]) → orderedB_out_g([])
orderedB_in_g(.(T3, [])) → orderedB_out_g(.(T3, []))
orderedB_in_g(.(s(T19), .(s(T20), T10))) → U2_g(T19, T20, T10, leA_in_gg(T19, T20))
leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → orderedB_out_g(.(s(T19), .(s(T20), T10)))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → U3_g(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
orderedB_in_g(.(0, .(s(0), T10))) → U4_g(T10, orderedB_in_g(.(s(0), T10)))
orderedB_in_g(.(0, .(0, T10))) → U5_g(T10, orderedB_in_g(.(0, T10)))
U5_g(T10, orderedB_out_g(.(0, T10))) → orderedB_out_g(.(0, .(0, T10)))
U4_g(T10, orderedB_out_g(.(s(0), T10))) → orderedB_out_g(.(0, .(s(0), T10)))
U3_g(T19, T20, T10, orderedB_out_g(.(s(T20), T10))) → orderedB_out_g(.(s(T19), .(s(T20), T10)))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 3 SCCs with 6 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LEA_IN_GG(s(T33), s(T34)) → LEA_IN_GG(T33, T34)

The TRS R consists of the following rules:

orderedB_in_g([]) → orderedB_out_g([])
orderedB_in_g(.(T3, [])) → orderedB_out_g(.(T3, []))
orderedB_in_g(.(s(T19), .(s(T20), T10))) → U2_g(T19, T20, T10, leA_in_gg(T19, T20))
leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → orderedB_out_g(.(s(T19), .(s(T20), T10)))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → U3_g(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
orderedB_in_g(.(0, .(s(0), T10))) → U4_g(T10, orderedB_in_g(.(s(0), T10)))
orderedB_in_g(.(0, .(0, T10))) → U5_g(T10, orderedB_in_g(.(0, T10)))
U5_g(T10, orderedB_out_g(.(0, T10))) → orderedB_out_g(.(0, .(0, T10)))
U4_g(T10, orderedB_out_g(.(s(0), T10))) → orderedB_out_g(.(0, .(s(0), T10)))
U3_g(T19, T20, T10, orderedB_out_g(.(s(T20), T10))) → orderedB_out_g(.(s(T19), .(s(T20), T10)))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(10) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(11) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LEA_IN_GG(s(T33), s(T34)) → LEA_IN_GG(T33, T34)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains

(12) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(13) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LEA_IN_GG(s(T33), s(T34)) → LEA_IN_GG(T33, T34)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(14) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

• LEA_IN_GG(s(T33), s(T34)) → LEA_IN_GG(T33, T34)
  The graph contains the following edges 1 > 1, 2 > 2

(15) YES

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

U2_G(T19, T20, T10, leA_out_gg(T19, T20)) → ORDEREDB_IN_G(.(s(T20), T10))
ORDEREDB_IN_G(.(s(T19), .(s(T20), T10))) → U2_G(T19, T20, T10, leA_in_gg(T19, T20))

The TRS R consists of the following rules:

orderedB_in_g([]) → orderedB_out_g([])
orderedB_in_g(.(T3, [])) → orderedB_out_g(.(T3, []))
orderedB_in_g(.(s(T19), .(s(T20), T10))) → U2_g(T19, T20, T10, leA_in_gg(T19, T20))
leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → orderedB_out_g(.(s(T19), .(s(T20), T10)))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → U3_g(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
orderedB_in_g(.(0, .(s(0), T10))) → U4_g(T10, orderedB_in_g(.(s(0), T10)))
orderedB_in_g(.(0, .(0, T10))) → U5_g(T10, orderedB_in_g(.(0, T10)))
U5_g(T10, orderedB_out_g(.(0, T10))) → orderedB_out_g(.(0, .(0, T10)))
U4_g(T10, orderedB_out_g(.(s(0), T10))) → orderedB_out_g(.(0, .(s(0), T10)))
U3_g(T19, T20, T10, orderedB_out_g(.(s(T20), T10))) → orderedB_out_g(.(s(T19), .(s(T20), T10)))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(17) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(18) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

U2_G(T19, T20, T10, leA_out_gg(T19, T20)) → ORDEREDB_IN_G(.(s(T20), T10))
ORDEREDB_IN_G(.(s(T19), .(s(T20), T10))) → U2_G(T19, T20, T10, leA_in_gg(T19, T20))

The TRS R consists of the following rules:

leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(19) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(20) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U2_G(T19, T20, T10, leA_out_gg(T19, T20)) → ORDEREDB_IN_G(.(s(T20), T10))
ORDEREDB_IN_G(.(s(T19), .(s(T20), T10))) → U2_G(T19, T20, T10, leA_in_gg(T19, T20))

The TRS R consists of the following rules:

leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))

The set Q consists of the following terms:

leA_in_gg(x0, x1)
U1_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(21) MRRProof (EQUIVALENT transformation)

By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

ORDEREDB_IN_G(.(s(T19), .(s(T20), T10))) → U2_G(T19, T20, T10, leA_in_gg(T19, T20))

Used ordering: Polynomial interpretation [POLO]:

POL(.(x₁, x₂)) = 1 + x₁ + x₂   
POL(0) = 0   
POL(ORDEREDB_IN_G(x₁)) = 2·x₁   
POL(U1_gg(x₁, x₂, x₃)) = 2·x₁ + 2·x₂ + x₃   
POL(U2_G(x₁, x₂, x₃, x₄)) = 2 + x₁ + 2·x₂ + 2·x₃ + x₄   
POL(leA_in_gg(x₁, x₂)) = 2·x₁ + 2·x₂   
POL(leA_out_gg(x₁, x₂)) = 2·x₁ + 2·x₂   
POL(s(x₁)) = 2·x₁   

(22) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U2_G(T19, T20, T10, leA_out_gg(T19, T20)) → ORDEREDB_IN_G(.(s(T20), T10))

The TRS R consists of the following rules:

leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))

The set Q consists of the following terms:

leA_in_gg(x0, x1)
U1_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(23) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(24) TRUE

(25) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

ORDEREDB_IN_G(.(0, .(0, T10))) → ORDEREDB_IN_G(.(0, T10))

The TRS R consists of the following rules:

orderedB_in_g([]) → orderedB_out_g([])
orderedB_in_g(.(T3, [])) → orderedB_out_g(.(T3, []))
orderedB_in_g(.(s(T19), .(s(T20), T10))) → U2_g(T19, T20, T10, leA_in_gg(T19, T20))
leA_in_gg(s(T33), s(T34)) → U1_gg(T33, T34, leA_in_gg(T33, T34))
leA_in_gg(0, s(0)) → leA_out_gg(0, s(0))
leA_in_gg(0, 0) → leA_out_gg(0, 0)
U1_gg(T33, T34, leA_out_gg(T33, T34)) → leA_out_gg(s(T33), s(T34))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → orderedB_out_g(.(s(T19), .(s(T20), T10)))
U2_g(T19, T20, T10, leA_out_gg(T19, T20)) → U3_g(T19, T20, T10, orderedB_in_g(.(s(T20), T10)))
orderedB_in_g(.(0, .(s(0), T10))) → U4_g(T10, orderedB_in_g(.(s(0), T10)))
orderedB_in_g(.(0, .(0, T10))) → U5_g(T10, orderedB_in_g(.(0, T10)))
U5_g(T10, orderedB_out_g(.(0, T10))) → orderedB_out_g(.(0, .(0, T10)))
U4_g(T10, orderedB_out_g(.(s(0), T10))) → orderedB_out_g(.(0, .(s(0), T10)))
U3_g(T19, T20, T10, orderedB_out_g(.(s(T20), T10))) → orderedB_out_g(.(s(T19), .(s(T20), T10)))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(26) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(27) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

ORDEREDB_IN_G(.(0, .(0, T10))) → ORDEREDB_IN_G(.(0, T10))

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains

(28) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(29) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ORDEREDB_IN_G(.(0, .(0, T10))) → ORDEREDB_IN_G(.(0, T10))

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(30) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

• ORDEREDB_IN_G(.(0, .(0, T10))) → ORDEREDB_IN_G(.(0, T10))
  The graph contains the following edges 1 > 1

(31) YES